Approximation of generalized ridge functions in high dimensions
نویسندگان
چکیده
منابع مشابه
Capturing Ridge Functions in High Dimensions from Point Queries
Constructing a good approximation to a function of many variables suffers from the “curse of dimensionality”. Namely, functions on R with smoothness of order s can in general be captured with accuracy at most O(n−s/N ) using linear spaces or nonlinear manifolds of dimension n. If N is large and s is not, then n has to be chosen inordinately large for good accuracy. The large value of N often pr...
متن کاملApproximation of Functions of Few Variables in High Dimensions
Let f be a continuous function defined on Ω := [0, 1]N which depends on only ` coordinate variables, f(x1, . . . , xN ) = g(xi1 , . . . , xi`). We assume that we are given m and are allowed to ask for the values of f at m points in Ω. If g is in Lip1 and the coordinates i1, . . . , i` are known to us, then by asking for the values of f at m = L` uniformly spaced points, we could recover f to th...
متن کاملApproximation by Ridge Functions and Neural Networks
We investigate the efficiency of approximation by linear combinations of ridge functions in the metric of L2(B ) with Bd the unit ball in Rd. If Xn is an n-dimensional linear space of univariate functions in L2(I), I = [−1, 1], and Ω is a subset of the unit sphere Sd−1 in Rd of cardinality m, then the space Yn := span{r(x · ξ) : r ∈ Xn, ω ∈ Ω} is a linear space of ridge functions of dimension ≤...
متن کاملOn some aspects of approximation of ridge functions
We present effective algorithms for uniform approximation of multivariate functions satisfying some prescribed inner structure. We extend in several directions the analysis of recovery of ridge functions f(x) = g(〈a, x〉) as performed earlier by one of the authors and his coauthors. We consider ridge functions defined on the unit cube [−1, 1]d as well as recovery of ridge functions defined on th...
متن کاملCapturing Functions in High Dimensions
1 Lecture 3: Capturing Functions in High Dimensions 1.1 Classifying High Dimensional Functions: Our last two lectures will study the problem of approximating (or capturing through querries) a function f defined on Ω ⊂ RN with N very large. The usual way of classifying functions is by smoothness. The more derivatives a function has the nicer it is and the more efficiently it can be numerically a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2019
ISSN: 0021-9045
DOI: 10.1016/j.jat.2019.04.006